The Kissing Triangles: The Aesthetics of Mathematical Discovery

Papert's (1978) appeal to reconsider the power and possibilities of the aesthetic in mathematics learning is often ignored in mathematics education research. This paper begins with the premise, put forth by Dewey (1934), that the aesthetic structures many dimensions of inquiry and experience. In the same way that using particular paintings, musical compositions, or even everyday experiences has been instrumental to attempts by philosophers to understand the aesthetic dimensions of meaning and experience in artistic domains, I propose that analysing a particular encounter with mathematics may help reveal the nature and role of the often nebulous responses of elegance, beauty, and `fit' to which mathematicians lay claim in their mathematical activity. To achieve this, I draw on and adapt the defining features of the aesthetic character of experience set forth by the aesthetician Beardsley (1982). This, in turn, sheds light on the role thataesthetics can play in mathematical inquiry and experience, and provides initial categories and conjectures that can be used to investigate the potential roles of aesthetics in mathematics learning contexts.This revised version was published online in September 2005 with corrections to the Cover Date.     

电子自旋假说的提出及其历史经验

电子自旋是原子物理学和量子力学的重要概念，电子自旋假说的产生在物理学史上具有一定的特殊性，该文系统论述了电子自旋假说提出了与被物理学界接受的历史，并从荷兰莱顿理论物理研究的学术环境、乌仑贝克和哥德斯密“理论型”与实验型”的互补、艾仑费斯行的教育艺术等方面分析了其历史经验。     

带有回报计划的动态客户关系管理模型及实验应用分析

在客户最大化效用及公司最大化CLV的动态环境下。对所提的带有回报计划的动态客户关系管理模型用于某超市的客户数据库中，发现模型的结果对这类客户是适用的。并给出了不同的客户状态空间对应的有效营销组合策略。结果表明：合适的回报计划可以促进客户的购买、提高公司的利润及缓解价格竞争。回报极限应该比客户的平均购买水平偏高，回报率应该与回报极限的改变方向一致。计划的时间范围应定在一年左右比较合适。对于累积购买水平较高的客户一般不邮寄商品信息。在回报计划的初期与末期不用打折。中期对那些购买次数很少的客户可以实行相应的降价策略。     

数学的默会知识及其教学意义

讨论了数学默会知识的涵义以及主要特点,论述了数学默会知识对数学学习和数学研究的影响及其对数学教学的意义.     

On the distribution of the number of retrials

We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server.     

A review ofL=λW and extensions

A fundamental principle of queueing theory isL=W (Little's law), which states that the time-average or expected time-stationary number of customers in a system is equal to the product of the arrival rate and the customer-average or expected customer-stationary time each customer spends in the system. This principle is now well known and frequently applied. However, in recent years there have been extensions, such as H=G and the continuous, distributional, ordinal and central-limit-theorem versions, which show that theL=W relation, when viewed properly, has much more power than was previously realized. Moreover, connections have been established between H=G and other fundamental relations, such as the rate conservation law and PASTA (Poisson arrivals see time averages), which show that there is a much greater unity in the overall theory than was previously realized. This paper provides a review.This paper is dedicated to the memory of our colleague Professor Peter Franken (1937–1989), who contributed greatly to the subject of this paper and to queueing theory more generally.     

关于极限理论的学习经验

分析极限理论在数学分析学习中的重要性，介绍学习极限理论的三点经验与体会，即充分理解基本内容；加强基本功训练；试着多问自己一些问题，学会举出各种各样的例子。     

指向学习体验的物质及其转化复习的教学实践——以“钠及其化合物”为例

学习体验是学生对学习内容、过程、方法、意义的自我感受和评估,对学生学习志趣、学习素养提升有积极正向作用。以钠及其化合物复习为例,将各类别物质间转化关系的构建、物质制备原理和条件的优选作为学习体验对象,依据学习体验的内在发展历程设计学习任务及活动,引导学生亲身体验学科认知方式、学科思维方法、学科应用价值,评价体验结果,激励学生自主学习发生。     

Consecutive customer losses in oscillating GIX/M//n systems with state dependent services rates

We address the probability that k or more Consecutive Customer Losses take place during a busy period of a queue, the so-called k-CCL probability, for oscillating GI ^X /M//n systems with state dependent services rates, also denoted as GI ^X /M(m)−M(m)//n systems, in which the service rates oscillate between two forms according to the evolution of the number of customers in the system. We derive an efficient algorithm to compute k-CCL probabilities in these systems starting with an arbitrary number of customers in the system that involves solving a linear system of equations. The results derived are illustrated for specific sets of parameters.     

Consecutive customer losses in regular and oscillating <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">n</Emphasis> systems

We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M ^X /G/1/n systems.